Ordered incremental training with genetic algorithms
نویسندگان
چکیده
Incremental training has been used for GA-based classifiers in a dynamic environment where training samples or new attributes/classes become available over time. In this paper, ordered incremental genetic algorithms (OIGAs) are proposed to address the incremental training of input attributes for classifiers. Rather than learning input attributes in batch as with normal GAs, OIGAs learn input attributes one after another. The resulting classification rule sets are also evolved incrementally to accommodate the new attributes. Furthermore, attributes are arranged in different orders by evaluating their individual discriminating ability. By experimenting with different attribute orders, different approaches of OIGAs are evaluated using four benchmark classification data sets. Their performance is also compared with normal GAs. The simulation results show that OIGAs can achieve generally better performance than normal GAs. The order of attributes does have an effect on the final classifier performance where OIGA training with a descending order of attributes performs the best.
منابع مشابه
Ordered Incremental Multi-Objective Problem Solving Based on Genetic Algorithms
Many Multiple Objective Genetic Algorithms (MOGAs) have been designed to solve problems with multiple conflicting objectives. Incremental approach can be used to enhance the performance of various MOGAs, which was developed to evolve each objective incrementally. For example, by applying the incremental approach to normal MOGA, the obtained Incremental Multiple Objective Genetic Algorithm (IMOG...
متن کاملThe Focused Multi-Criteria Ranking Approach to Machine Learning Algorithm Selection - An Incremental Meta Learning Assistant f
The main goal of the ESPRIT METAL project is to use metalearning to develop an incrementally adaptable assistant system to provide usersupport in machine learning and data mining. Meta data consists of performance outcomes of ML algorithms on known datasets. Using new models of data envelopment analysis to deal with multiple criteria, an ordered ranking of algorithms is obtained for each datase...
متن کاملIncremental Evaluation of Ordered Attribute Grammars for Asynchronous Subtree Replacements
Incremental algorithms for evaluating attribute grammars (AGs) have been extensively studied in recent years, primarily because of their application in language-based environments. Ordered attribute grammars are a subclass of AGs for which efficient evaluators can be constructed. Previous incremental algorithms for ordered attribute grammars only allowed one modification 10 the program at a tim...
متن کاملA Novel Intrusion Detection Systems based on Genetic Algorithms-suggested Features by the Means of Different Permutations of Labels’ Orders
Intrusion detection systems (IDS) by exploiting Machine learning techniques are able to diagnose attack traffics behaviors. Because of relatively large numbers of features in IDS standard benchmark dataset, like KDD CUP 99 and NSL_KDD, features selection methods play an important role. Optimization algorithms like Genetic algorithms (GA) are capable of finding near-optimum combination of the fe...
متن کاملIncremental approximation computation in incomplete ordered decision systems
Approximation computation is a critical step in rough sets theory used in knowledge discovery and other related tasks. In practical applications, an information system often evolves over time by the variation of attributes or objects. Effectively computing approximations is vital in data mining. Dominance-based rough set approach can handle information with preference-ordered attribute domain, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Intell. Syst.
دوره 19 شماره
صفحات -
تاریخ انتشار 2004